q-ary Lempel–Cohn–Eastman Sequences
نویسندگان
چکیده
In this paper, for a prime p and a positive integer q such that q|pn − 1, we constructed q-ary Lempel– Cohn–Eastman(LCE) sequences with period p − 1. These sequences have maximum autocorrelation magnitude bounded by 4. Particularly, in the case of q = 3, the maximum autocorrelation magnitude of the ternary LCE sequences is 3. And the maximum autocorrelation magnitude of the quaternary LCE sequences is 4 or 2 √ 2.
منابع مشابه
Multiplicities of Character Values of Binary Sidel'nikov-Lempel-Cohn-Eastman Sequences
Binary Sidel’nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we continue the study of [1]. We first express the multiple roots of character polynomials of SLCE sequences into certain kinds of Jacobi sums. Then by making use ...
متن کاملLinear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
In this correspondence, the linear complexity over of Lempel–Cohn–Eastman (LCE) sequences of period 1 for an odd prime is determined. For = 3 5 and 7, the exact closed-form expressions for the linear complexity over of LCE sequences of period 1 are derived. Further, the trace representations for LCE sequences of period 1 for = 3 and 5 are found by computing the values of all Fourier coefficient...
متن کاملSome Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel’nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower...
متن کامل1 5 Se p 20 05 On the number of t - ary trees with a given path length
We show that the number of t-ary trees with path length equal to p is exp ( h(t−1)t log t p log p (1 + o(1)) ) , where h(x)=−x log x−(1−x) log(1−x) is the binary entropy function. Besides its intrinsic combinatorial interest, the question recently arose in the context of information theory, where the number of t-ary trees with path length p estimates the number of universal types, or, equivalen...
متن کاملEquivalent Transformation Pairs of a q-ary Sequence and its Complex Polyphase Form and their Application
The Golay complementary sequences have been studied for more than five decades since Golay first discovered those sequences. However, few studies on the correlation function of transformation form of q-ary complementary sequences. New notions of equivalent transformation on q-ary sequences and equivalent transformation pair of a q-ary sequence and its complex polyphase form are put forward. A t...
متن کامل